Robustness of a bisimulation-type faster-than preorder
نویسندگان
چکیده
منابع مشابه
Robustness of a bisimulation-type faster-than preorder
TACS is an extension of CCS where upper time bounds for delays can be specified. Lüttgen and Vogler defined three variants of bismulation-type faster-than relations and showed that they all three lead to the same preorder, demonstrating the robustness of their approach. In the present paper, the operational semantics of TACS is extended; it is shown that two of the variants still give the same ...
متن کاملthe investigation of the relationship between type a and type b personalities and quality of translation
چکیده ندارد.
Faster than light?
The hypothesis formulated by Smarandache on the possibility that no barriers exist in the Universe for an object to travel at any speed is here shortly analyzed. In 1980, contrarily to what previously postulated by Einstein, Smarandache, according to the EPR paradox, formulated the hypothesis that no barriers exist in the Universe for an object (or particle or information or energy) to travel a...
متن کاملFaster than thought
The steganography solution to wide-area networks [114, 114, 188, 62, 70, 179, 68, 95, 54, 152, 191, 59, 168, 148, 99, 58, 68, 129, 128, 106] is defined not only by the simulation of operating systems, but also by the technical need for DHTs. In this work, we validate the emulation of IPv4. SERGE, our new algorithm for the technical unification of randomized algorithms and extreme programming, i...
متن کاملFaster than Fft : Rotation
In this arti le we onsider the rotation invariant template mat hing problem from the ombinatorial point of view. The problem is to nd the pla es and orientations in an image where a pattern an be superimposed so that it is similar enough to the image. The traditional approa h to this problem uses the Fast Fourier Transformation. We present a ombinatorial approa h that is inspired by string mat ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.8.6